t=int(input())
for i in range (t):
n=int(input())
cnt=list(map(int,input().split()))
index=1
a=cnt[0]
for i in range (n):
if cnt[i]>a:
a=cnt[i]
index=i+1
print(index)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int dt=86400;
#define pb push_back
#define ff first
#define ss second
const ll c=2022;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
// freopen("input.txt","r", stdin);
int t;cin>>t;
while(t--){
int n;cin>>n;
vector<pair<int,int>> cnt(n+1);
for(int i=1;i<=n;i++){
int x;cin>>x;
cnt[i]={x, i};
}
sort(cnt.begin()+1, cnt.end());
cout << cnt[n].second << endl;
}
return 0;
}
Help Jarvis! | Lift queries |
Goki and his breakup | Ali and Helping innocent people |
Book of Potion making | Duration |
Birthday Party | e-maze-in |
Bricks Game | Char Sum |
Two Strings | Anagrams |
Prime Number | Lexical Sorting Reloaded |
1514A - Perfectly Imperfect Array | 580A- Kefa and First Steps |
1472B- Fair Division | 996A - Hit the Lottery |
MSNSADM1 Football | MATCHES Playing with Matches |
HRDSEQ Hard Sequence | DRCHEF Doctor Chef |
559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |
1441. Build an Array With Stack Operations | 1356. Sort Integers by The Number of 1 Bits |
922. Sort Array By Parity II | 344. Reverse String |
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |